Combinatorial Shape Decomposition
نویسندگان
چکیده
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
منابع مشابه
Toward Perception-Based Shape Decomposition
The aim of this work is to decompose shapes into parts which are consistent to human perception. We propose a novel shape decomposition method which utilizes the three perception rules suggested by psychological study: the Minima rule, the Short-cut rule and the Convexity rule. Unlike the previous work, we focus on improving the convexity of the decomposed parts while minimizing the cut length ...
متن کاملInnovative Computational Methods for Structural Optimization
The objective of this paper is to investigate the efficiency of combinatorial optimization methods and in particular algorithms based on evolution strategies, when incorporated into structural optimization problems. Evolution strategies algorithms are used either on a stand-alone basis, or combined with a conventional mathematical programming technique. Furthermore, the structural analysis phas...
متن کاملComputationally Efficient Techniques for Structural Optimization
The objective of this paper is to investigate the efficiency of combinatorial optimization methods and in particular algorithms based on evolution strategies, when incorporated into structural optimization problems. Evolution strategies algorithms are used either on a stand-alone basis, or combined with a conventional mathematical programming technique. Furthermore, the structural analysis phas...
متن کاملAcyclicity in Three-manifolds
An acyclic compactum in an orientable, open 3-manifold has arbitrarily close, polyhedral neighborhoods whose components are compact 3-manifolds with a special structure. Frequently, these 3-manifolds have free fundamental groups. These observations and some results from combinatorial group theory are exploited to deduce facts about the homomorphism of fundamental groups induced by an acyclic ma...
متن کاملStacking sequence and shape optimization of laminated composite plates via a level-set method
We consider the optimal design of composite laminates by allowing a variable stacking sequence and in-plane shape of each ply. In order to optimize both variables we rely on a decomposition technique which aggregates the constraints into one unique constraint margin function. Thanks to this approach, an exactly equivalent bi-level optimization problem is established. This problem is made up of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007